|
|
A posteriori error estimates for numerical solution of convection-difusion problems
Šebestová, Ivana ; Dolejší, Vít (advisor) ; Sváček, Petr (referee) ; Brandts, Jan (referee)
This thesis is concerned with several issues of a posteriori error estimates for linear problems. In its first part error estimates for the heat conduction equation discretized by the backward Euler method in time and discontinuous Galerkin method in space are derived. In the second part guaranteed and locally efficient error estimates involving algebraic error for Poisson equation discretized by the discontinuous Galerkin method are derived. The technique is based on the flux reconstruction where meshes with hanging nodes and variable polynomial degree are allowed. An adaptive strategy combining both adaptive mesh refinement and stopping criteria for iterative algebraic solvers is proposed. In the last part a numerical method for computing guaranteed lower and upper bounds of principal eigenvalues of symmetric linear elliptic differential operators is presented. 1
|
|
|
Automatic hp-adaptivity on Meshes with Arbitrary-Level Hanging Nodes in 3D
Kůs, Pavel ; Vejchodský, Tomáš (advisor) ; Segeth, Karel (referee) ; Dolejší, Vít (referee)
The thesis is concerned with theoretical and practical aspects of the hp- adaptive finite element method for solving elliptic and electromagnetic prob- lems described by partial differential equations in three spatial dimensions. Besides the standard element refinements, the hp-adaptivity allows indepen- dent adaptation of degrees of the polynomial approximation as well. This leads to exponentially fast convergence even for problems with singularities. The efficiency of the hp-adaptivity is enhanced even more by the ability of the algorithm to work with meshes with arbitrary-level hanging nodes. This generality, however, leads to great complexity of the implementation. There- fore, the thesis concentrates on the mathematical analysis of algorithms that have led to successful implementation of the method. In addition, the the- sis discusses the numerical integration in 3D and the implementation of the method itself. Finally, numerical results obtained by this new implemen- tation are presented. They confirm advantages of hp-adaptivity on meshes with arbitrary-level hanging nodes. 1
|
|
|
A posteriori error estimates for numerical solution of convection-difusion problems
Šebestová, Ivana ; Dolejší, Vít (advisor) ; Sváček, Petr (referee) ; Brandts, Jan (referee)
This thesis is concerned with several issues of a posteriori error estimates for linear problems. In its first part error estimates for the heat conduction equation discretized by the backward Euler method in time and discontinuous Galerkin method in space are derived. In the second part guaranteed and locally efficient error estimates involving algebraic error for Poisson equation discretized by the discontinuous Galerkin method are derived. The technique is based on the flux reconstruction where meshes with hanging nodes and variable polynomial degree are allowed. An adaptive strategy combining both adaptive mesh refinement and stopping criteria for iterative algebraic solvers is proposed. In the last part a numerical method for computing guaranteed lower and upper bounds of principal eigenvalues of symmetric linear elliptic differential operators is presented. 1
|
|
|
Automatic hp-adaptivity on Meshes with Arbitrary-Level Hanging Nodes in 3D
Kůs, Pavel ; Vejchodský, Tomáš (advisor) ; Segeth, Karel (referee) ; Dolejší, Vít (referee)
The thesis is concerned with theoretical and practical aspects of the hp- adaptive finite element method for solving elliptic and electromagnetic prob- lems described by partial differential equations in three spatial dimensions. Besides the standard element refinements, the hp-adaptivity allows indepen- dent adaptation of degrees of the polynomial approximation as well. This leads to exponentially fast convergence even for problems with singularities. The efficiency of the hp-adaptivity is enhanced even more by the ability of the algorithm to work with meshes with arbitrary-level hanging nodes. This generality, however, leads to great complexity of the implementation. There- fore, the thesis concentrates on the mathematical analysis of algorithms that have led to successful implementation of the method. In addition, the the- sis discusses the numerical integration in 3D and the implementation of the method itself. Finally, numerical results obtained by this new implemen- tation are presented. They confirm advantages of hp-adaptivity on meshes with arbitrary-level hanging nodes. 1
|
guest ::
